TSTP Solution File: PUZ136^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : PUZ136^1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 18:19:40 EDT 2022
% Result : Theorem 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 16 unt; 5 typ; 0 def)
% Number of atoms : 58 ( 26 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 61 ( 13 ~; 8 |; 4 &; 36 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 37 ( 0 ^ 25 !; 12 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_horus,type,
horus: $i ).
thf(tp_kronus,type,
kronus: $i ).
thf(tp_parent,type,
parent: $i > $i > $o ).
thf(tp_sutekh,type,
sutekh: $i ).
thf(tp_zeus,type,
zeus: $i ).
thf(1,axiom,
~ ( parent @ sutekh @ horus ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
thf(2,axiom,
parent @ kronus @ zeus,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
thf(3,conjecture,
? [P: $i > $o,X: $i,Y: $i] :
( ( P @ X )
& ~ ( P @ Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hotwo) ).
thf(4,negated_conjecture,
( ( ? [P: $i > $o,X: $i,Y: $i] :
( ( P @ X )
& ~ ( P @ Y ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,plain,
( ( ? [P: $i > $o,X: $i,Y: $i] :
( ( P @ X )
& ~ ( P @ Y ) ) )
= $false ),
inference(unfold_def,[status(thm)],[4]) ).
thf(6,plain,
( ( ~ ( parent @ sutekh @ horus ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( parent @ kronus @ zeus )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(8,plain,
( ( ~ ? [P: $i > $o,X: $i,Y: $i] :
( ( P @ X )
& ~ ( P @ Y ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(9,plain,
( ( ! [P: $i > $o] :
( ! [X: $i] :
~ ( P @ X )
| ! [Y: $i] : ( P @ Y ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(10,plain,
( ( parent @ kronus @ zeus )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( parent @ sutekh @ horus ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(12,plain,
( ( ! [P: $i > $o] :
( ! [X: $i] :
~ ( P @ X )
| ! [Y: $i] : ( P @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(13,plain,
( ( parent @ sutekh @ horus )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
! [SV1: $i > $o] :
( ( ! [SY3: $i] :
~ ( SV1 @ SY3 )
| ! [SY4: $i] : ( SV1 @ SY4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(15,plain,
! [SV1: $i > $o] :
( ( ( ! [SY3: $i] :
~ ( SV1 @ SY3 ) )
= $true )
| ( ( ! [SY4: $i] : ( SV1 @ SY4 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(16,plain,
! [SV2: $i,SV1: $i > $o] :
( ( ( ~ ( SV1 @ SV2 ) )
= $true )
| ( ( ! [SY4: $i] : ( SV1 @ SY4 ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(17,plain,
! [SV2: $i,SV1: $i > $o] :
( ( ( SV1 @ SV2 )
= $false )
| ( ( ! [SY4: $i] : ( SV1 @ SY4 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(18,plain,
! [SV2: $i,SV3: $i,SV1: $i > $o] :
( ( ( SV1 @ SV3 )
= $true )
| ( ( SV1 @ SV2 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(19,plain,
! [SV2: $i,SV3: $i] :
( ( ( SV3 = SV2 )
= $true )
| ( ( SV2 = SV2 )
= $false ) ),
inference(replace_leibnizEQ,[status(thm)],[18:[bind(SV1,$thf( ^ [SV4: $i] : ( SV4 = SV2 ) ))]]) ).
thf(20,plain,
! [SV2: $i,SV3: $i] :
( ( SV3 = SV2 )
= $true ),
inference(sim,[status(thm)],[19]) ).
thf(21,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[10,20,13]) ).
thf(22,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ136^1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat May 28 21:43:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 2
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/0.34 (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:4,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.19/0.39 ********************************
% 0.19/0.39 * All subproblems solved! *
% 0.19/0.39 ********************************
% 0.19/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:2,translation:fof_full)
% 0.19/0.39
% 0.19/0.39 %**** Beginning of derivation protocol ****
% 0.19/0.39 % SZS output start CNFRefutation
% See solution above
% 0.19/0.39
% 0.19/0.39 %**** End of derivation protocol ****
% 0.19/0.39 %**** no. of clauses in derivation: 22 ****
% 0.19/0.39 %**** clause counter: 21 ****
% 0.19/0.39
% 0.19/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------